Prefixed Tableau Systems for Logic of Proofs and Provability
Identifieur interne : 001515 ( Main/Exploration ); précédent : 001514; suivant : 001516Prefixed Tableau Systems for Logic of Proofs and Provability
Auteurs : Hidenori Kurokawa [Japon]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper, we introduce prefixed tableau systems for logics combining Artemov’s logic of proofs, which is introduced in order to explore combinatorial structure of proofs, and the logic of provability (strong provability), which has been studied as a logic of formal provability (provability and truth) in arithmetic for decades. Such joint logics have already been studied, but no cut-free tableau systems for these logics have been available in the literature so far. We show the admissibility of cut for these systems via semantic completeness for cut-free prefixed tableau systems for these logics.
Url:
DOI: 10.1007/978-3-642-40537-2_18
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002662
- to stream Istex, to step Curation: 002629
- to stream Istex, to step Checkpoint: 000141
- to stream Main, to step Merge: 001527
- to stream Main, to step Curation: 001515
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Prefixed Tableau Systems for Logic of Proofs and Provability</title><author><name sortKey="Kurokawa, Hidenori" sort="Kurokawa, Hidenori" uniqKey="Kurokawa H" first="Hidenori" last="Kurokawa">Hidenori Kurokawa</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A3CA0681C9B628C718B6068A1CDF0792C81ABC1C</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40537-2_18</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-VBMH15HS-4/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002662</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002662</idno><idno type="wicri:Area/Istex/Curation">002629</idno><idno type="wicri:Area/Istex/Checkpoint">000141</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000141</idno><idno type="wicri:doubleKey">0302-9743:2013:Kurokawa H:prefixed:tableau:systems</idno><idno type="wicri:Area/Main/Merge">001527</idno><idno type="wicri:Area/Main/Curation">001515</idno><idno type="wicri:Area/Main/Exploration">001515</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Prefixed Tableau Systems for Logic of Proofs and Provability</title><author><name sortKey="Kurokawa, Hidenori" sort="Kurokawa, Hidenori" uniqKey="Kurokawa H" first="Hidenori" last="Kurokawa">Hidenori Kurokawa</name><affiliation wicri:level="1"><country xml:lang="fr">Japon</country><wicri:regionArea>Department of Information Science, Kobe University</wicri:regionArea><wicri:noRegion>Kobe University</wicri:noRegion></affiliation><affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper, we introduce prefixed tableau systems for logics combining Artemov’s logic of proofs, which is introduced in order to explore combinatorial structure of proofs, and the logic of provability (strong provability), which has been studied as a logic of formal provability (provability and truth) in arithmetic for decades. Such joint logics have already been studied, but no cut-free tableau systems for these logics have been available in the literature so far. We show the admissibility of cut for these systems via semantic completeness for cut-free prefixed tableau systems for these logics.</div></front></TEI><affiliations><list><country><li>Japon</li></country></list><tree><country name="Japon"><noRegion><name sortKey="Kurokawa, Hidenori" sort="Kurokawa, Hidenori" uniqKey="Kurokawa H" first="Hidenori" last="Kurokawa">Hidenori Kurokawa</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001515 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001515 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:A3CA0681C9B628C718B6068A1CDF0792C81ABC1C
|texte= Prefixed Tableau Systems for Logic of Proofs and Provability
}}
| This area was generated with Dilib version V0.6.33. |  |